#include<bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 1;
int r[MAXN],cnt[MAXN];
priority_queue<int,vector<int>,less<int> > q,st;
int main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    int n;
    cin >> n;
    for(int i = 1;i <= n;i++){
        cin >> r[i];
        q.push(r[i]);
        cnt[r[i]]++;
    }
    int tp = q.top();
    for(int i = 1;i <= tp;i++){
        if(cnt[i]) st.push(cnt[i]);
    }
    cout << st.top();
    fclose(stdin);
    fclose(stdout);
    return 0;
}
